package com.yun.algorithmproblem.leetcodenotcomplete;

public class Leetcode2360 {

	public int longestCycle(int[] edges) {
		return 0;
	}
}
